Particle Tracking Algorithm using Linear Affine Transformation
نویسندگان
چکیده
منابع مشابه
An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملVisual Tracking using Kernel Projected Measurement and Log-Polar Transformation
Visual Servoing is generally contained of control and feature tracking. Study of previous methods shows that no attempt has been made to optimize these two parts together. In kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. This main target is accomplished by using Lyapanov theory. A Lyapanov candidat...
متن کاملAn affine transformation invariance approach to cell tracking
Accurate and robust methods for automatically tracking rolling leukocytes facilitate inflammation research as leukocyte motion is a primary indicator of inflammatory response in the microvasculature. This paper reports on an affine transformation invariance approach we proposed to track rolling leukocyte in intravital microscopy image sequences. The method is based on the affine transformation ...
متن کاملObject-Based Image Steganography Using Affine Transformation
The typical model of steganography has led the prisoners’ problem, in which two persons attempt to communicate covertly without alerting the warden. The general way to achieve this task is to embed the message in an innocuous-looking medium. In this paper, an object-based geometric embedding technique is proposed for solving the prisoners’ problem. The main idea is to embed secret data through ...
متن کاملLearning an Affine Transformation for Non-linear Dimensionality Reduction
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcoming makes them unsuitable for problems such as classification and regression. We propose a novel dimensionality reduction algorithm which learns a parametric mapping between the high-dimensional space and the embedded s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Visualization Society of Japan
سال: 1997
ISSN: 1884-037X,0916-4731
DOI: 10.3154/jvs.17.supplement1_121